Competitive cross‐subsidization
نویسندگان
چکیده
منابع مشابه
6 Competitive Networks and Competitive Learning
Competitive neural networks belong to a class of recurrent networks, and-they are based on algorithms of unsupervised learning, such as the competitive algorithm explained in this section. In competitive learning, the output neurons of a neural network compete among themselves to become active (to be "fired"). Whereas in multiplayer perceptrons several output neurons may be active simultaneousl...
متن کاملComplex competitive systems and competitive thermodynamics.
This publication reviews the framework of abstract competition, which is aimed at studying complex systems with competition in their generic form. Although the concept of abstract competition has been derived from a specific field--modelling of mixing in turbulent reacting flows--this concept is, generally, not attached to a specific phenomenon or application. Two classes of competition rules, ...
متن کاملCompetitive Framing∗
I present a simple framework for modeling two-firm market competition, where each firm chooses a market alternative as well as a costless “marketing message”. Consumers follow a frame-dependent choice function, where the frame is a probabilistic function of the firms’ marketing messages. This framework embeds several recent models in the literature on markets with boundedly rational consumers. ...
متن کاملCompetitive Paper
In the late 1970s, a new research impetus occurred in the new product development literature with the publications of Eric Von Hippel's two seminal investigations (1976; 1977), where he advocated the involvement of users in the idea generation stage of the new product development process. Von Hippel‟s conceptualisation of a customer active paradigm (1978) gave focus to a new generation of resea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The RAND Journal of Economics
سال: 2019
ISSN: 0741-6261,1756-2171
DOI: 10.1111/1756-2171.12293